/*
 * Copyright 2020-2030 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.wwl.stack;

import com.wwl.array.Array;

/**
 * @author wangweili
 * @version 1.0
 * @date 2021/4/08 21:44 下午
 */
public class ArrayStack<T> implements Stack<T> {

    private Array<T> array;

    public ArrayStack(int capacity) {
        array = new Array<>(capacity);
    }

    public ArrayStack() {
        array = new Array<>();
    }


    @Override
    public int getSize() {
        return array.size();
    }

    @Override
    public boolean isEmpty() {
        return array.isEmpty();
    }

    public int capacity() {
        return array.getCapacity();
    }

    @Override
    public T pop() {
        return array.removeLast();
    }

    @Override
    public void push(T t) {
        array.addLast(t);
    }

    @Override
    public T peek() {
        return array.getLast();
    }

    @Override
    public String toString() {
        return "ArrayStack = [" +
                "array=" + array +
                "] TOP";
    }

}
